Spectral Transforms Calculation through Decision Diagrams
نویسندگان
چکیده
منابع مشابه
Remarks on Codes, Spectral Transforms, and Decision Diagrams
In this paper, we discuss definitions, features, and relationships of Reed-Muller transforms, Reed-Muller codes and their generalizations to multiple-valued cases, and Reed-Muller decision diagrams. The novelty in this primarily review paper resides in putting together these concepts in the same context and providing a uniform point of view to their definition in terms of a convolutionwise mult...
متن کاملDiscrete Function Representations Utilizing Decision Diagrams and Spectral Techniques
All discrete function representations become exponential in size in the worst case. Binary decision diagrams have become a common method of representing discrete functions in computer-aided design applications. For many functions, binary decision diagrams do provide compact representations. This work presents a way to represent large decision diagrams as multiple smaller partial binary decision...
متن کاملLinear Transformation of Binary Decision Diagrams Trough Spectral Domain
We propose a new algorithm for linear transformation of BDD, by using of Walsh Hadamard coefficients of the represented function. This approach is based on the property that each spectral coefficient represents the measure of correlation between the function and the corresponding EXOR sum of variables. The proposed algorithm is applicable to large examples, and in many cases leads to substantia...
متن کاملEquational Binary Decision Diagrams Equational Binary Decision Diagrams
We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is de ned, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satis ability and tautology checking can be done in constant time. Several procedures to eliminate equality from BDDs have been reporte...
متن کاملHybrid Spectral Transform Diagrams
We give a uniform algebraic framework for computing hybrid spectral transforms in an eecient manner. Based on properties of the Kronecker product, we derive a set of recursive equations, which leads naturally to an algorithm for computing such transforms eeciently. As a result, many applications of transforms like the Walsh transform and the Reed-Muller transform, which were previously impossib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 2002
ISSN: 1065-514X,1563-5171
DOI: 10.1080/10655140290009765